Solving SameGame and its Chessboard Variant
نویسندگان
چکیده
We introduce a new solving method for SameGame puzzles based on Monte-Carlo simulation, that improves the previous best known method. We also cover the chessboard variant, a subclass of the SameGame puzzle for which we can exactly define which puzzles are solvable and which ones are not. Next to this we present a quantitative approach to classify the difficulty of a given puzzle, as well as an indication of whether or not a given puzzle is solvable.
منابع مشابه
Addressing NP-Complete Puzzles with Monte-Carlo Methods
NP-complete problems are a challenging task for researchers, who investigate tractable versions and attempt to generalise the methods used for solving them. Over the years a large set of successful standard methods have been developed. We mention A* and IDA* which have proven to be reasonably successful in solving a set of NP-complete problems, particularly single-agent games (puzzles). However...
متن کاملNested Rollout Policy Adaptation with Selective Policies
Monte Carlo Tree Search (MCTS) is a general search algorithm that has improved the state of the art for multiple games and optimization problems. Nested Rollout Policy Adaptation (NRPA) is an MCTS variant that has found record-breaking solutions for puzzles and optimization problems. It learns a playout policy online that dynamically adapts the playouts to the problem at hand. We propose to enh...
متن کاملSingle-player Monte-Carlo tree search for SameGame
Classic methods such as A* and IDA* are a popular and successful choice for one-player games. However, without an accurate admissible evaluation function, they fail. In this article we investigate whether Monte-Carlo Tree Search (MCTS) is an interesting alternative for one-player games where A* and IDA* methods do not perform well. Therefore, we propose a new MCTS variant, called Single-Player ...
متن کاملDistributed Nested Rollout Policy for SameGame
Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search heuristic for puzzles and other optimisation problems. It achieves state of the art performance on several games including SameGame. In this paper, we design several parallel and distributed NRPA-based search techniques, and we provide number of experimental insights about their execution. Finally, we use our best implementation to...
متن کاملAnalogy-making in Situation Theory
Analogy-making is finding analogies between different situations. In this paper, we provide a new model of computational analogy-making which uses Situation Theory as its formal background. Situation Theory is a semantic and logical theory which provides a naturalistic way to represent relations in situations. The system described in this paper is aimed at solving analogy problems made by basic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009